Computing the Primary Decomposition of Zero-dimensional Ideals
نویسندگان
چکیده
منابع مشابه
Primary decomposition of zero-dimensional ideals over finite fields
A new algorithm is presented for computing primary decomposition of zero-dimensional ideals over finite fields. Like Berlekamp’s algorithm for univariate polynomials, the new method is based on the invariant subspace of the Frobenius map acting on the quotient algebra. The dimension of the invariant subspace equals the number of primary components, and a basis of the invariant subspace yields a...
متن کاملPrimary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice
Monico published in [Journal of Symbolic Computation, 34(5):451–459, 2002] an algorithm to compute the primary decomposition of a zero-dimensional ideal, that mostly relies on a characteristic polynomial computation modulo the input ideal, and its factorization. We revisit this algorithm, and discuss Maple and Magma implementations that contradict the somehow pessimistic conclusions of Monico’s...
متن کاملEvaluation techniques for zero-dimensional primary decomposition
This paper presents a new algorithm that computes the local algebras of the roots of a zero-dimensional polynomial equation system, with a number of operations in the coefficient field that is polynomial in the number of variables, in the evaluation cost of the equations and in a Bézout number.
متن کاملIdeals Contracted from 1-dimensional Overrings with an Application to the Primary Decomposition of Ideals
We prove that each ideal of a locally formally equidimensional analytically un-ramiied Noetherian integral domain is the contraction of an ideal of a one-dimensional semilo-cal birational extension domain. We give an application to a problem concerning the primary decomposition of powers of ideals in Noetherian rings. It is shown in S2] that for each ideal I in a Noetherian commutative ring R t...
متن کاملThe Core of Zero-dimensional Monomial Ideals
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0571